Mechanized Reasoning for Continuous Problem Domains
نویسنده
چکیده
Specification and verification in continuous problem domains are key topics for the practical application of formal methods and mechanized reasoning. I discuss one approach to linear continuous control systems and consider the challenges and opportunities raised for mechanized reasoning. These include practical implementation and integration issues, algorithms in computational real algebraic geometry and hard open questions such as the Schanuel conjecture. I conclude with an overview of some recent new results on decidability and undecidability for vector spaces and related theories.
منابع مشابه
Mechanized Reasoning for Continuous Problem Domains (Invited Talk)
Specification and verification in continuous problem domains are key topics for the practical application of formal methods and mechanized reasoning. I discuss one approach to linear continuous control systems and consider the challenges and opportunities raised for mechanized reasoning. These include practical implementation and integration issues, algorithms in computational real algebraic ge...
متن کاملAn Introduction to Mechanized Reasoning
Mechanized reasoning uses computers to verify proofs and to help discover new theorems. Computer scientists have applied mechanized reasoning to economic problems but – to date – this work has not yet been properly presented in economics journals. We introduce mechanized reasoning to economists in three ways. First, we introduce mechanized reasoning in general, describing both the techniques an...
متن کاملContinuous Case-Based Reasoning
Case-based reasoning systems have traditionallybeen used to perform high-level reasoning in problem domains that can be adequately described using discrete, symbolic representations. However, many realworld problem domains, such as autonomous robotic navigation, are better characterized using continuous representations. Such problem domains also require continuous performance, such as continuou...
متن کاملTowards Interoperable Mechanized Reasoning Systems: the Logic Broker Architecture
There is a growing interest in the integration of mechanized reasoning systems such as automated theorem provers, computer algebra systems, and model checkers. State-of-the-art reasoning systems are the result of many man-years of careful development and engineering, and usually they provide a high degree of sophistication in their respective domain. Yet they often perform poorly when applied o...
متن کاملReasoning with Powerdomains in Isabelle/HOLCF
This paper presents the first fully-mechanized formalization of powerdomains, implemented in the HOLCF logic of the Isabelle theorem prover. The powerdomain library provides an abstract view of powerdomains to the user, hiding the complicated implementation details. The library also provides proof automation, in the form of sets of rewrite rules for solving equalities and inequalities on powerd...
متن کامل